منابع مشابه
Completeness of the LELS Inference Rule in Automated Theorem Proving
The Extended Linking Strategy (ELS) is a hyper-style strategy whose underlying principle is to control and perform (extend) a series of standard resolution on clauses. However it may be treated as a unique inference rule that serially links several resolution steps into one. We define links and clause chains, and introduce the ideas of ELS with left merging (LELS). We also presented the soundne...
متن کاملA topological completeness theorem
We prove a topological completeness theorem for innnitary geometric theories with respect to sheaf models. The theorem extends a classical result of Makkai and Reyes, stating that any topos with enough points has an open spatial cover. We show that one can achieve in addition that the cover is connected and locally connected.
متن کاملA General NP Completeness Theorem
A detailed model of a random access computation over an ab stract domain is presented and the existence of an NP complete problem is proven under broad conditions which unify Cook s theorem and recent results in the real number model by Blum Shub and Smale
متن کاملPost's Functional Completeness Theorem
The paper provides a new proof, in a style accessible to modern logicians and teachers of elementary logic, of Post's Functional Completeness Theorem. Post's Theorem states the necessary and sufficient conditions for an arbitrary set of (2-valued) truth functional connectives to be expressively complete, that is, to be able to express every (2-valued) truth function or truth table. The theorem ...
متن کاملPost's Functional Completeness Theorem
The paper provides a new proof, in a style accessible to modern logicians and teachers of elementary logic, of Post's Functional Completeness Theorem. Post's Theorem states the necessary and sufficient conditions for an arbitrary set of (2-valued) truth functional connectives to be expressively complete, that is, to be able to express every (2-valued) truth function or truth table. The theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1963
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093957392